منابع مشابه
Ranking Cartesian Sums and K-maximum subarrays
We design a simple algorithm that ranks K largest in Cartesian sums X + Y in O(m + K logK) time. Based on this, K-maximum subarrays can be computed in O(n+K logK) time (1D) and O(n +K logK) time (2D) for input array of size n and n × n respectively.
متن کاملImproved Algorithms for the k Maximum-Sums Problems
Given a sequence of n real numbers and an integer k, 1 k 1 2n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all possible segment sums. Recently, Bengtsson and Chen gave an O(min{k + n log2 n, n √ k})-time algorithm for this problem. Bae and Takaoka later proposed a more efficient algorithm for small k. In this paper, we propose an O(n ...
متن کاملMaximum Edge-Disjoint Paths in k-Sums of Graphs
We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be Ω( √ n) even for planar graphs [14] due to a simple topological obstruction and a major focus, following earlier work [17], has been understanding the gap if s...
متن کاملSums and k-sums in abelian groups of order k
Let G be an abelian group of order k. How is the problem of minimizing the number of sums from a sequence of given length in G related to the problem of minimizing the number of k-sums? In this paper we show that the minimum number of k-sums for a sequence a1, . . . , ar that does not have 0 as a k-sum is attained at the sequence b1, . . . , br−k+1,0, . . . ,0, where b1, . . . , br−k+1 is chose...
متن کاملOn max-k-sums
The max-k-sum of a set of real scalars is the maximum sum of a subset of size k, or alternatively the sum of the k largest elements. We study two extensions: First, we show how to obtain smooth approximations to functions that are pointwise max-k-sums of smooth functions. Second, we discuss how the max-k-sum can be defined on vectors in a finite-dimensional real vector space ordered by a closed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.03.011